Abstarct: One of the problems solved by quantum algorithms faster than classical algorithms is related to the search problem. The quantum search algorithm, the basic principles of which were proposed by Graver, is one of the best quantum search methods capable of significantly speeding up calculations from the order of O(N) in classical computers to the order of O( p N) reduce in quantum computers, which has a significant reduction for large N. In this thesis, we investigate the effect of nonlinear factors of quantum mechanics on the search algorithm. Quantum mechanics has been subjected to severe tests for many years and its theoretical predictions for various systems have been compared with the results of very accurate measurements. But, in fact, these tests should be considered tests of the accuracy and correctness of the Hamiltonian equation (which describes the physical system), not the tests of quantum mechanics itself. Schrödinger’s equation is a linear equation and is the main equation of quantum mechanics. But the question is whether the existence of non-linear aspects in quantum mechanics can lead to deep consequences in theoretical physics or not?! In the linear case, the optimal solution is the Grover’s algorithm It runs in time of the order of O((N k ) 1 4 ) which, in short, we find one of the k marked ground states among We search for N canonical ground states. But it should be noted that nonlinear variants of quantum mechanics can solve problems that are impossible in standard quantum theory, such as the complete detection of non-orthogonal states. In this thesis, we investigate the influence of quantum mechanical nonlinear factors on the search algorithm.